Divisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups
نویسنده
چکیده
3.3. The greatest common divisor and the least common multiple 12 3.4. Parabolic divisors 14 3.5. Divisibility: further properties 14 4. Normal forms arising from HNN extensions 16 4.1. HNN -normal form 16 5. Conjugacy problem 18 5.1. Conjugacy Criterion for HNN -extensions 18 5.2. Block decomposition 22 5.3. Conjugacy with respect to a subgroup 23 5.4. An algorithm for solving the Conjugacy Problem 25 5.5. Double cosets of parabolic subgroups. 26 6. Complexity of algorithms: some estimates 27
منابع مشابه
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملOn Recognizable Languages in Left Divisibility Monoids
We describe a class of monoids where c-rational languages can be deened analogously to trace theory and where these languages are precisely the recognizable ones. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to our left divisibility monoids. We obtain Ochma nski's theorem on recognizable languages in free partially commutative mo...
متن کاملSolvability of Equations in Free Partially Commutative Groups Is Decidable
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic tool for analyzing concurrent systems. The question whether the existential theory of trace equations is decidable has been solved positively in 1996. Free partially commutative groups (graph groups) generalize trace monoids in the sense that every element has an inverse. In this paper we show that ...
متن کاملOrthogonal systems in finite graphs
Let Γ be a finite graph and GΓ be the corresponding free partially commutative group. In this paper we construct orthogonality theory for graphs and free partially commutative groups. The theory developed here provides tools for the study of the structure of the centraliser lattice of partially commutative groups.
متن کاملEmbedding simple commutative monoids into simple refinement monoids
Say that a cone is a commutative monoid that is in addition conical, i.e., satisfies x+y=0 ⇒ x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind, satisfying in addition various divisibility conditions. We do this in particular for all cones, or for all separative cones, or for all...
متن کامل